Reduced Polynomial Order Linear Prediction - IEEE Signal Processing Letters
نویسندگان
چکیده
Reduced rank linear predictive frequency and direction-of-arrival (DOA) estimation algorithms use the singular value decomposition (SVD) to produce a noise-cleaned linear prediction vector. These algorithms then root this vector to obtain a subset of roots, whose angles contain the desired frequency or DOA information. The roots closest to the unit circle are deemed to be the "signal roots." The rest of the roots are "extraneous." The extraneous roots are expensive to calculate. Further, a search must be done to discern the signal roots from the extraneous roots. Here, we present a reduced polynomial order linear prediction method that simplifies the rooting computation for applications where high-speed processing is critical.
منابع مشابه
Blind MIMO channel identification from second order statistics using rank deficient channel convolution matrix
For multiuser systems, several direct blind identification algorithms require that the linear multiple-input multiple-output (MIMO) system have a full rank convolution matrix. This condition requires that the system transfer function be irreducible and column reduced. We show that this restrictive identification condition can be relaxed for some direct blind identification methods to accommodat...
متن کاملA modification of the discrete polynomial transform
The Discrete Polynomial Transform (DPT) has been introduced recently as a computationally eecient algorithm for estimating the phase parameters of constant-amplitude polynomial phase signals. In this note we present a modiication of the DPT, which improves the estimation accuracy. We show by a perturbation analysis that the mean-squared error of the estimates is reduced when the order of the po...
متن کاملImage reconstruction by convolution with symmetrical piecewise nth-order polynomial kernels
The reconstruction of images is an important operation in many applications. From sampling theory, it is well known that the sine-function is the ideal interpolation kernel which, however, cannot be used in practice. In order to be able to obtain an acceptable reconstruction, both in terms of computational speed and mathematical precision, it is required to design a kernel that is of finite ext...
متن کاملOn the duality between line-spectral frequencies and zero-crossings of signals
Line spectrum pairs (LSPs) are the roots (located in the complex-frequency or -plane) of symmetric and antisymmetric polynomials synthesized using a linear prediction (LPC) polynomial. The angles of these roots, known as line-spectral frequencies (LSFs), implicitly represent the LPC polynomial and hence the spectral envelope of the underlying signal. By exploiting the duality between the time a...
متن کاملUniversal linear prediction by model order weighting
A common problem that arises in adaptive filtering, autoregressive modeling, or linear prediction is the selection of an appropriate order for the underlying linear parametric model. We address this problem for linear prediction, but instead of fixing a specific model order, we develop a sequential prediction algorithm whose sequentially accumulated average squared prediction error for any boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998